Towards a Satisfactory Invariant Measure of Dual-Resonance Amplitudes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a measure of vulnerability, tenacity of a Graph

If we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.In this paper we discuss...

متن کامل

Invariant elements in the dual Steenrod algebra

‎In this paper‎, ‎we investigate the invariant elements of the dual mod $p$ Steenrod subalgebra ${mathcal{A}_p}^*$ under the conjugation map $chi$ and give bounds on the dimensions of $(chi-1)({mathcal{A}_p}^*)_d$‎, ‎where $({mathcal{A}_p}^*)_d$ is the dimension of ${mathcal{A}_p}^*$ in degree $d$‎.

متن کامل

towards a measure of vulnerability, tenacity of a graph

if we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.in this paper we discuss...

متن کامل

Dual Amplitudes and Basic Assumptions

Four simple assumptions for scattering amplitudes are proposed in order to derive dual amplitudes. The assumptions are conventional except the one which states that each term of an amplitude, corresponding to a certain combination of Regge poles ins, t and u channels, is constructed by a triple product form of three unknown functions, U1 (t), {12 (s) and us (u). This is arrived at by an abstrac...

متن کامل

A scale invariant measure of clutter.

We propose a measure of clutter for real images that can be used to predict search times. This measure uses an efficient segmentation algorithm (P. Felzenszwalb & D. Huttenlocher, 2004) to count the number of regions in an image. This number is not uniquely defined, however, because it varies with the scale of segmentation. The relationship between the number of regions and the scale of segment...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Progress of Theoretical Physics

سال: 1978

ISSN: 0033-068X,1347-4081

DOI: 10.1143/ptp.59.590